Towards Intelligent Inductive Proof Engineering
نویسنده
چکیده
This paper deals with inductive theorem proving (ITP for short). It does not provide new theoretical results but analyses existing ITP methods from an AI point of view. The presentation is based on the implicit ITP approach, i.e. ITP using the well-developed framework of rewriting and completion techniques for systems of equations and rewrite rules. We think that the relevant practical problems for successful (partially) automated ITP are essentially the same as or at least closely related to those occurring in the more conventional framework of explicit ITP using schemas. The theoretical foundations of implicit ITP are brieey reviewed focussing on the central ideas as well as on important operationalization issues. Moreover, a brief comparison of explicit and implicit ITP approaches is included. In particular, we clarify some criticisms raised against the implicit ITP approach. The main part of the paper is devoted to a thorough discussion of central ITP problems from the viewpoint of system designers and users. We point out and exemplify the necessity of linking together the whole process of formalizing, modelling and structuring abstract (equational) specii-cations of algorithms and corresponding (inductive) properties to be veriied. Crucial aspects of the whole speciication and proof engineering process are isolated and discussed , in particular conceptual and proof-technical ones. We argue that such an analysis (which of course has to be continued and deepened) is necessary for an adequate integration and combination of intelligent user-guided and machine-supported automated inductive reasoning. Finally the main theoretical and practical problems as well as promising perspectives for future work are sketched, in particular concerning architectural and design principles for future generation inductive theorem provers.
منابع مشابه
First Steps Towards Cumulative Inductive Types in CIC
We discuss our on-going research on making inductive types cumulative in the predicative calculus of inductive constructions (pCIC) – the logic of the Coq proof assistant. Having inductive types be cumulative alleviates some problems that occur while working with large inductive types, e.g., the category of small categories, in pCIC. We present the pCuIC system which adds cumulativity for induc...
متن کاملProof Tree Kernels: a Candidate Ingredient for Intelligent Optimization
Reactive search techniques typically rely on the search history in order to adapt heuristics to the local conformation of the search space. By viewing search history as the trace of the optimization program, we aim to apply strategies for learning from example-traces, as developed in the fields of machine learning and inductive logic programming. We believe that Proof Tree Kernels, which we rec...
متن کاملTowards Mechanized Semantics of Uml Sequence Diagrams and Refinement Relation
Sequence diagrams are widely used to describe the behavior of software during the design phase. Sequence diagrams have significant practical value. However, a systematic way of understanding and specifying the formal semantics of sequence diagrams does not exist. Analyzing the design properties may reveal software faults before software implementation, thereby improving the software quality and...
متن کاملTowards Verified Construction for Planar Class of a Qualitative Spatial Representation
PLCA is a framework for qualitative spatial reasoning that uses symbolic objects and the relationships between them. The second and third authors introduced inductive constructions to show construction of a PLCA expression. They also proved that expressions obtained by inductive constructions are planar (planarity) and that planar PLCA expressions can be obtained using inductive constructions (...
متن کاملToward a Super Duper Hardware Tactic
We present techniques for automating many of the tedious aspects of hardware veriication in a higher order logic theorem proving environment. We employ two complementary approaches. The rst involves intelligent tactics which incorporate many of the smaller steps currently applied by the user. The second uses hardware combinators to partially automate inductive proofs for iterated hardware struc...
متن کامل